Optimisasi Penjadwalan Perawat Dengan Program Gol Linear
نویسندگان
چکیده
منابع مشابه
Formal Ontology and Principles of GOL
The General Ontological Language (GOL) is a formal framework for representing and building ontologies. The purpose of GOL is to provide a system of toplevel ontologies which can be used as a basis for constructing domain-specific ontologies. The present paper gives an overview about the basic categories and the principles of GOL. GOL is part of the work of the Ontologies in Medicine (Onto-Med) ...
متن کاملGol: towards an Axiomatized Upper-level Ontology
Every domain-speci c ontology must use as a framework some upper-level ontology which describes the most general, domain-independent categories of reality. In the present paper we sketch a new type of upper-level ontology, which is intended to be the basis of a knowledge modelling language GOL (for: `General Ontological Language'). It turns out that the upperlevel ontology underlying standard m...
متن کاملApprentice Program: Linear Algebra
Definition 1.1. Let K be a field. (V,+, ·) is a vector space over K, if (V,+) is an Abelian group, and · : K × V → V (called scalar multiplication) is distributive, associative and multiplication by 1 is the identity on V . This compact definition unwinds to give us the following ten(!) axioms: (1) + : V × V → V (2) u+ (v + w) = (u+ v) + w. (3) u+ v = v + u. (4) ∃0 ∈ V such that v + 0 = 0 + v =...
متن کاملLinear Projective Program Syntax
Based on an extremely simple program notation more advanced program features can be developed in linear projective program syntax such as conditional statements, while loops, recursion, use of an evaluation stack, object classes, method calls etc. Taking care of a cumulative and bottom up introduction of such complex features while providing appropriate projections into the lower levels of lang...
متن کاملLinear Program for the Problem
In this lecture, we study the topic of Job Scheduling. The problem of job scheduling is that if we have n jobs and m machines and we have a processing time pij of each machine i for each job j, the task is to find a schedule to assign the jobs to the m machines to complete all the n jobs such that the completion time of all jobs will be minimized. If each job j has the same running time pj on e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Sains Matematika dan Statistika
سال: 2015
ISSN: 2615-8663,2460-4542
DOI: 10.24014/jsms.v1i2.1955